Fully compatible extended definition TV. Part 1. Theoretical consideration on dynamic characteristis.
نویسندگان
چکیده
منابع مشابه
1 Mantaining Dynamic Matrices for Fully Dynamic
In this paper we introduce a general framework for casting fully dynamic transitive closure into the problem of reevaluating polynomials over matrices. With this technique, we improve the best known bounds for fully dynamic transitive closure. In particular, we devise a deterministic algorithm for general directed graphs that achieves O(n) amortized time for updates, while preserving unit worst...
متن کاملUnderstanding Cross-Sector Collaboration in E-Government Development: Theoretical Consideration Based on Extended Bryson's Framework
With the rapid development of e-government, cross-sector collaboration has been one of the most important issues to academia and practitioners. Although collaboration was a classical topic in public administration research, digital age and e-government environment complicate the related issues from multi-perspectives. Based on accumulated literature in the public administration research area an...
متن کاملFully Dynamic Planarity Testing in Planar Embedded Graphs (Extended Abstract)
We present the rst data structure to maintain an embedded planar graph under arbitrary edge insertions, arbitrary edge deletions and queries that test whether the insertion of a new edge would violate the planarity of the embedding. Our data structure supports online updates and queries on an n{vertex embedded planar graph in O(log 2 n) worst{case time, it can be built in O(n) time and requires...
متن کاملLoose Interface Definition: An Extended Interface Definition for Dynamic Service Composition
The concept of Dynamic Service Composition is to create a complex composite service through combining multiple software or hardware components at runtime. Dynamic Service Composition is similar to object-oriented or component-based software design approach since in both approaches an application is built as a combination of multiple components. However, in Dynamic Service Composition, an applic...
متن کاملFully Dynamic $(1+\epsilon)$-Approximate Matchings
We present the first data structures that maintain near optimal maximum cardinality and maximum weighted matchings on sparse graphs in sublinear time per update. Our main result is a data structure that maintains a (1 + ǫ) approximation of maximum matching under edge insertions/deletions in worst case O( √ mǫ) time per update. This improves the 3/2 approximation given in [Neiman, Solomon, STOC ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Institute of Television Engineers of Japan
سال: 1985
ISSN: 0386-6831,1884-9652
DOI: 10.3169/itej1978.39.885